Packing non-identical circles within a rectangle with open length
نویسندگان
چکیده
منابع مشابه
Packing non-identical circles within a rectangle with open length
Packing non-identical circles inside a rectangle witnesses a wide range of industrial applications. However, the non-convex constraints in this problem make it intractable using exact analytical approaches. Even via heuristic methods, the solution time for industrial-scale instances sometimes is too long to be acceptable. This article aims to challenge the existing methods for the benchmark ins...
متن کاملPacking circles within ellipses
The problem of packing circles within ellipses is considered in the present paper. A new parametrization is employed by means of which the ellipse is represented by a rectangle. Algorithms with global convergence properties are presented. Numerical experiments are exhibited.
متن کاملNew and improved results for packing identical unitary radius circles within triangles, rectangles and strips
The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of nonlinear equations systems through the N...
متن کاملOptimal Rectangle Packing on Non-Square Benchmarks
The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. We propose two new benchmarks, one where the orientation of the rectangles is fixed and one where it is free, that include rectangles of various aspect ratios. The new benchmarks avoid certain properties of easy instances, which we identify as ins...
متن کاملParallel greedy algorithms for packing unequal circles into a strip or a rectangle
Given a finite set of circles of different sizes we study the Strip Packing Problem (SPP) as well as the Knapsack Problem (KP). The SPP asks for a placement of all circles (without overlap) within a rectangular strip of fixed width so that the variable length of the strip is minimized. The KP requires packing of a subset of the circles in a rectangle of fixed dimensions so that the wasted area ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2012
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-012-9948-6